Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems
نویسندگان
چکیده
منابع مشابه
Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems
An overview of the restricted growth function genetic algorithm is given. Empirically we show that the algorithm exhibits poor performance and is consistently outperformed on a range of problems by two very basic evolutionary algorithms with blind operators.
متن کاملAn Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems
This paper presents a novel fuzzy clustering technique based on grouping genetic algorithms (GGAs), which are a class of evolutionary algorithms especially modified to tackle grouping problems. Our approach hinges on a GGA devised for fuzzy clustering by means of a novel encoding of individuals (containing elements and clusters sections), a new fitness function (a superior modification of the D...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAn Efficient Grouping Genetic Algorithm
Genetic algorithm is an intelligent way for solving combinatorial, NP hard problems and many other problems which cannot be easily solved by applying traditional mathematical formula. The proposed method gives a new variant of the Standard Genetic algorithm which is very simple and will easily find the solution even for complex problems. It implements the concept of grouping to reach the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2011
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00040